Traffic-based floor preference for the scheduling of elevators in elevator group control system
نویسندگان
چکیده
منابع مشابه
Dynamic Partition of Elevator Group Control System with Destination Floor Guidance in Up-peak Traffic
This paper presents a new modeling of elevator group intelligent scheduling system with destination floor guidance. The traditional input mode of separate hall call registration and the destination selection is improved to a single-input mode. On this basis, dynamic partition method in up-peak traffic is studied. This method means dynamically adjust division of floor region based on flow rate a...
متن کاملPreference-Based Group Scheduling
Traditional group scheduling applications often treat users' availability as binary: free or busy. This is an unrealistic representation because not all times are equally free or busy. The inflexibility makes it difficult to find times with which everyone is truly satisfied. We present an online group scheduling approach by which users indicate four-tier preferences for meeting times on a calen...
متن کاملDecision-Theoretic Group Elevator Scheduling
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are represented by a discrete-state Markov chain embedded in the continuous phase-space diagram of a moving elevator car. The chain is evaluated efficiently using dynamic programming to compute measures of future system perfor...
متن کاملRisk-Averse Group Elevator Scheduling
We introduce a novel group elevator scheduler based on an explicit decision-theoretic calculation for the expectation of any polynomial function of passengers’ waiting times, marginalized over sources of uncertainty in the system state. The same framework can be used to identify risky assignments that have low expected costs but may cause some individuals to be ”stranded” with excessive waits f...
متن کاملSubmodular Function Maximization for Group Elevator Scheduling
We propose a novel approach for group elevator scheduling by formulating it as the maximization of submodular function under a matroid constraint. In particular, we propose to model the total waiting time of passengers using a quadratic Boolean function. The unary and pairwise terms in the function denote the waiting time for single and pairwise allocation of passengers to elevators, respective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science
سال: 2019
ISSN: 2502-4760,2502-4752
DOI: 10.11591/ijeecs.v16.i2.pp835-842